Dynamic Triangulation of Implicit Surfaces: towards the handling of topology changes
نویسندگان
چکیده
In this paper, we introduce a new approach to mesh an animated implicit surface for rendering purposes. This approach is based on a double triangulation of the surface. In the first triangulation, the vertices are the nodes of a finite element model. The aim of this model is to uniformly and dynamically sample the surface. It is robust, efficient and prevents the inversion of triangles. The second triangulation is dynamically created from the first one at each frame and provides details in regions of high curvature. Lastly, we present a mechanism to deal with both the topological merging and splitting of surfaces. As shown in our results, our approach provides robust, quality, interactive rendering of animated implicit surfaces, including those with certain kinds of topology changes. Key-words: implicit surfaces, real-time rendering, triangulation, interactive modeling, animation, particle system, finite element Triangulation dynamique de surfaces implicites : vers une gestion des changements de topologie Résumé : Dans ce rapport, nous introduisons une nouvelle approche pour mailler une surface implicite animée dans le but d’en faire le rendu. Cette approche est basée sur une double triangulation de la surface. Dans la première, les sommets sont les nœuds d’un modèle éléments finis. Le but de ce modèle est d’échantillonner uniformément et dynamiquement la surface. Il est robuste, performant, et empêche l’inversion des triangles. La seconde triangulation est dynamiquement créée à partir de la première à chaque image et fournit des détails dans les régions de forte courbure. Enfin, nous présentons un mécanisme permettant de gérer la fusion et la séparation topologiques des surfaces. Comme le montrent nos résultats, notre approche permet un rendu de qualité, robuste et interactif de surfaces implicites animés, y compris celles comportant certains changements de topologie. Mots-clés : surfaces implicites, rendu temps-réel, triangulation, modélisation interactive, animation, système de particules, éléments finis Dynamic Triangulation of Implicit Surfaces: towards the handling of topology changes 3 Figure 1: An animated surface defined by two skeleton elements crossing each other.
منابع مشابه
Isogeometric Topology Optimization by Using Optimality Criteria and Implicit Function
A new method for structural topology optimization is introduced which employs the Isogeometric Analysis (IA) method. In this approach, an implicit function is constructed over the whole domain by Non-Uniform Rational B-Spline (NURBS) basis functions which are also used for creating the geometry and the surface of solution of the elasticity problem. Inspiration of the level set method zero level...
متن کاملAdaptive Triangulation of Point-Based Level Sets
Point based level sets are a recently developed implicit surface representation that combines the benefits of point-set surfaces and grid-based level sets. They provide convenient topology changes and adaptivity and are thus useful for tracking the evolution of heavily deforming surfaces. However, it is often useful to extract an explicit mesh from the implicit surface, for example for renderin...
متن کاملDynamic Triangulation of Animated Skeleton-Based Implicit Surfaces
Due to their ability to form complex structures from a few simple primitives by blending with each other, skeleton-based implicit surfaces gained considerable importance for modeling, visualization and animation. A major difficulty when using the implicit modeling paradigm lies in the efficient rendering of the modeled objects. This paper describes the fundamental ideas of a method for the dyna...
متن کاملECG IST-2000-26473 Effective Computational Geometry for Curves and Surfaces
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds points on S and updates the 3dimensional Delaunay triangulation of the points. The method is very simple and works in 3d-space without requiring to parameterize the surface. Taking advantage of recent results on the restricted...
متن کاملProvably Good Surface Sampling and Approximation
We present an algorithm for meshing surfaces that is a simple adaptation of a greedy “farthest point” technique proposed by Chew. Given a surface S, it progressively adds points on S and updates the 3-dimensional Delaunay triangulation of the points. The method is very simple and works in 3d-space without requiring to parameterize the surface. Taking advantage of recent results on the restricte...
متن کامل